A Completeness Theorem for "Total Boolean Functions"

نویسنده

  • Pierre Hyvernat
چکیده

In [3], Christine Tasson introduces an algebraic notion of totality for a denotational model of linear logic. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the " boolean centroidal calculus " w.r.t. total boolean functions. 0. Introduction. Even though the question answered in this note has its roots in denotational semantics for the differential λ-calculus ([2] and [1], see also [4]), no background in proof-theory is necessary to understand the problem. In the end, it boils down to a question about a special kind of polynomials in 2n variables over an arbitrary field k. This note is almost " self-contained " , assuming only mild knowledge about polynomials and vector spaces (and a modicum about affine spaces). The only exotic (??) technology is the following formula for counting monomials or multi-sets. The number of different monomials of degree d over n variables is usually denoted n d. A simple counting argument shows that the number of monomials of degree at most d in n variables is n+1 d. A closed formula for n d in terms of the usual binomial coefficient is given by: n d = n + d − 1 n. Thus, the number of monomials of degree at most d in n variables is given by n+d n. 1. Total boolean polynomials. The category of finite dimensional vector spaces give a denotational model for multiplicative additive linear logic. Adding the exponential is a non-trivial task and requires infinite dimensional spaces and thus, topology. Moreover, we need to find a subclass of spaces satisfying E ≃ E * *. Finiteness spaces (see [1]) give a solution. We won't need the details of this technology, but it is interesting to note that objects are topological vector spaces, and that morphisms (in the co-Kleisli category of the !-comonad) are " analytic functions " , i.e. power series. Of particular interest is the space B used to interpret the booleans: this is the vector space k 2 , where k is the ambient field. A morphism from B n to B is a pair (P 1 , P 2) of " finite " power series (polynomials) in 2n variables, where each pair (X 2i−1 , X 2i) of variables corresponds to the i-th argument of the function. A boolean value (a, b) is total if …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness in Probabilistic Metric Spaces

The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...

متن کامل

An integer programming proof of Cook’s theorem of NP-completeness

The theory of NP-completeness has its roots in a foundational result by Cook, who showed that Boolean satisfiability (SAT) is NP-complete and thus unlikely to admit an efficient solution. We prove an analogous result using binary integer programming in the place of SAT. The proof gives deeper insight into the theory of NP-completeness to operations researchers for whom the language of integer p...

متن کامل

Suzuki-type fixed point theorems for generalized contractive mappings‎ ‎that characterize metric completeness

‎Inspired by the work of Suzuki in‎ ‎[T. Suzuki‎, ‎A generalized Banach contraction principle that characterizes metric completeness‎, Proc‎. ‎Amer‎. ‎Math‎. ‎Soc. ‎136 (2008)‎, ‎1861--1869]‎, ‎we prove a fixed point theorem for contractive mappings‎ ‎that generalizes a theorem of Geraghty in [M.A‎. ‎Geraghty‎, ‎On contractive mappings‎, ‎Proc‎. ‎Amer‎. ‎Math‎. ‎Soc., ‎40 (1973)‎, ‎604--608]‎an...

متن کامل

ON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES

In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...

متن کامل

A Completeness Theorem for “ Total Boolean Functions ” July 2008

0. Introduction. Even though the question answered in this note has its roots in denotational semantics for the differential λ-calculus ([2] and [1], see also [4]), no background in proof-theory is necessary to understand the problem. In the end, it boils down to a question about a special kind of polynomials in 2n variables over an arbitrary field k. This note is almost “self-contained”, assum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0905.4060  شماره 

صفحات  -

تاریخ انتشار 2009